Low-Power and Optimized VLSI Implementation of Compact Recursive Discrete Fourier Transform (RDFT) Processor for the Computations of DFT and Inverse Modified Cosine Transform (IMDCT) in a Digital Radio Mondiale (DRM) and DRM+ Receiver
نویسنده
چکیده
This paper presents a compact structure of recursive discrete Fourier transform (RDFT) with prime factor (PF) and common factor (CF) algorithms to calculate variable-length DFT coefficients. Low-power optimizations in VLSI implementation are applied to the proposed RDFT design. In the algorithm, for 256-point DFT computation, the results show that the proposed method greatly reduces the number of multiplications/additions/computational cycles by 97.40/94.31/46.50% compared to a recent approach. In chip realization, the core size and chip size are, respectively, 0.84 × 0.84 and 1.38 × 1.38 mm. The power consumption for the 288and 256-point DFT computations are, respectively, 10.2 (or 0.1051) and 11.5 (or 0.1176) mW at 25 (or 0.273) MHz simulated by NanoSim. It would be more efficient and more suitable than previous works for DRM and DRM applications.
منابع مشابه
Reduction of Non-Orthogonal Interference in OFDM Receivers by Optimized Windowing
For conventional orthogonal frequencydivision multiplexing (OFDM) systems, the guard interval is disregarded in the receiver and rectangular shaped windows are used implicitly due to the discrete Fourier transform (DFT). We consider a Nyquistshaped window in the receiver, so that the transmit signal does not need to be modified, and optimize the window shape in order to suppress interference fr...
متن کاملVLSI IMPLEMENTATION OF ARITHMETIC COSINE TRANSFORM IN FPGA TECHNOLOGY B.Bhavani
In Image processing the Image compression can improve the performance of the digital systems by reducing the cost and time in image storage and transmission without significant reduction of the Image quality. This paper describes hardware architecture of low complexity Discrete Cosine Transform (DCT) architecture for image compression[6]. In this DCT architecture, common computations are identi...
متن کاملA Low - Delay MDCT / IMDCT
© 2013 Sangkil Lee and Insung Lee 935 This letter presents an algorithm for selecting a low delay for the modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT). The implementation of conventional MDCT and IMDCT requires a 50% overlap-add (OLA) for a perfect reconstruction. In the OLA process, an algorithmic delay in the frame length is employed. A reduced overlap window and MDCT/IM...
متن کاملA New Recursive Decomposition Algorithm for Realizing Fast IMDCT Computation
In this paper, a new decomposition algorithm for realizing fast inverse modified discrete cosine transform (IMDCT) computation is presented. The decomposition algorithm can convert a pair of long transforms into 2 pairs of short transforms with half size of the long transforms. In addition, the decomposition algorithm can be utilized recursively to attain shorter transforms and reduce computati...
متن کاملRecursive Algorithms and Systolic Architectures for Realization of Type-II Discrete Cosine Transform and Inverse Discrete Cosine Transform
The paper presents novel recursive algorithms for realization of one-dimensional type-II discrete cosine transform (DCT) and inverse discrete cosine transform (IDCT) of any length. By using some mathematical techniques, recursive expressions for DCT and IDCT have been developed. The number of additions and multiplications in the recursive algorithm for DCT are less in comparison with some other...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013